Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Interval
نویسندگان
چکیده
In sensitivity analysis one wants to know how the problem and the optimal solutions change under the variation of the input data. We consider the case when variation happens in the right hand side of the constraints and/or in the linear term of the objective function. We are interested to find the range of the parameter variation in Convex Quadratic Optimization (CQO) problems where the support set of a given primal optimal solution remains invariant. This question has been first raised in Linear Optimization (LO) and known as Type II (so called Support Set Invariancy) sensitivity analysis. We present computable auxiliary problems to identify the range of parameter variation in support set invariancy sensitivity analysis for CQO. It should be mentioned that all given auxiliary problems are LO problems and can be solved by an interior point method in polynomial time. We also highlight the differences between characteristics of support set invariancy sensitivity analysis for LO and CQO.
منابع مشابه
Support set expansion sensitivity analysis in convex quadratic optimization
In support set expansion sensitivity analysis, one concerns to find the range of parameter variation where the perturbed problem has an optimal solution with the support set that includes the support set of the given optimal solution of the unperturbed problem. In this paper, we consider the perturbed convex quadratic optimization problem and present a method to identify the support set expansi...
متن کاملAnalytical aspects of the interval unilateral quadratic matrix equations and their united solution sets
This paper introduces the emph{interval unilateral quadratic matrix equation}, $IUQe$ and attempts to find various analytical results on its AE-solution sets in which $A,B$ and $CCC$ are known real interval matrices, while $X$ is an unknown matrix. These results are derived from a generalization of some results of Shary. We also give sufficient conditions for non-emptiness of some quasi-solutio...
متن کاملOn the quadratic support of strongly convex functions
In this paper, we first introduce the notion of $c$-affine functions for $c> 0$. Then we deal with some properties of strongly convex functions in real inner product spaces by using a quadratic support function at each point which is $c$-affine. Moreover, a Hyers–-Ulam stability result for strongly convex functions is shown.
متن کاملSupport Vector Machine Classifiers with Uncertain Knowledge Sets via Robust Optimization
In this paper we study Support Vector Machine(SVM) classifiers in the face of uncertain knowledge sets and show how data uncertainty in knowledge sets can be treated in SVM classification by employing robust optimization. We present knowledge-based SVM classifiers with uncertain knowledge sets using convex quadratic optimization duality. We show that the knowledge-based SVM, where prior knowled...
متن کاملOptimization : A Journal of Mathematical Programming and Operations Research
In this article we study support vector machine (SVM) classifiers in the face of uncertain knowledge sets and show how data uncertainty in knowledge sets can be treated in SVM classification by employing robust optimization. We present knowledge-based SVM classifiers with uncertain knowledge sets using convex quadratic optimization duality. We show that the knowledge-based SVM, where prior know...
متن کامل